Analysis of Slepian Wolf Coding
نویسنده
چکیده
منابع مشابه
Approaching the Slepian-Wolf Limit with LDPC Coset Codes
We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...
متن کاملOn the Reliability Function of Variable-Rate Slepian-Wolf Coding
The reliability function of variable-rate Slepian-Wolf coding is linked to the reliability function of channel coding with constant composition codes, through which computable lower and upper bounds are derived. The bounds coincide at rates close to the Slepian-Wolf limit, yielding a complete characterization of the reliability function in that rate regime. It is shown that variable-rate Slepia...
متن کاملAnalysis of 1-D Nested Lattice Quantization and Slepian-Wolf Coding for Wyner-Ziv Coding of i.i.d. Sources
Entropy coded scaler quantization (ECSQ) performs 1.53 dB from optimal lossy compression at high data rates. In this paper, we generalize this result for distributed source coding with side information. 1-D nested scaler quantization with Slepian-Wolf coding is compared to Wyner-Ziv coding of i.i.d. Gaussian sources at high data rates. We show that nested scaler quantization with Slepian-Wolf c...
متن کاملOn the linear codebook-level duality between Slepian-Wolf coding and channel coding
In this paper, it is shown that each Slepian–Wolf coding problem is related to a dual channel coding problem in the sense that the sphere packing exponents, random coding exponents, and correct decoding exponents in these two problems are mirror-symmetrical to each other. This mirror symmetry is interpreted as a manifestation of the linear codebook-level duality between Slepian–Wolf coding and ...
متن کاملOn the redundancy of Slepian--Wolf coding
In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is considered. Given any jointly memoryless source-side information pair with finite alphabet, the redundancy of variable rate Slepian–Wolf coding of with decoder only side information depends on both the block length and the decoding block error probability , and is defined as the difference between the minimum...
متن کاملDensity Evolution Technique for LDPC Codes in Slepian-Wolf Coding of Nonuniform Sources
This paper attempts to examine the optimality of LDPC codes for compression of nonuniform source with Slepian-Wolf coding using density evolution technique. The primary goal is to evaluate the performance of LDPC codes with reference to turbo codes (in SF-ISF setup). The appreciable difference between LDPC and turbo codes is also discussed in this paper. The threshold values obtained from the d...
متن کامل